Banishing Robust Turing Completeness

نویسندگان

  • Lane A. Hemaspaandra
  • Sanjay Jain
  • Nikolai K. Vereshchagin
چکیده

This paper proves that “promise classes” are so fragilely structured that they do not robustly (i.e. with respect to all oracles) possess Turinghard sets even in classes far larger than themselves. In particular, this paper shows that FewP does not robustly possess Turing hard sets for UP ∩ coUP and IP ∩ coIP does not robustly possess Turing hard sets for ZPP. It follows that ZPP, R, coR, UP∩coUP, UP, FewP∩coFewP, FewP, and IP ∩ coIP do not robustly possess Turing complete sets. This both resolves open questions of whether promise classes lacking robust downward closure under Turing reductions (e.g., R, UP, FewP) might robustly have Turing complete sets, and extends the range of classes known not to robustly contain many-one complete sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness

Do complexity classes have many-one complete sets if and only if they have Turingcomplete sets? We prove that there is a relativized world in which a relatively natural complexity class—namely a downward closure of NP, R 1-tt(NP)—has Turing-complete sets but has no many-one complete sets. In fact, we show that in the same relativized world this class has 2-truth-table complete sets but lacks 1-...

متن کامل

Minimal Ingredients for Turing Completeness in Membrane Computing

In this paper we provide several computability results looking for minimal ingredients needed to obtain Turing completeness of various bio-inspired computation models (membrane systems). We emphasize the relevance of number two in reaching Turing completeness for several membrane systems.

متن کامل

An Embryonics Implementation of a Self-Replicating Universal Turing Machine

The goal of this contribution is to describe how a universal Turing machine was embedded into a hardware system in order to verify the computational universality of a novel architecture. This implementation was realized with a multicellular automaton inspired by the embryonic development of living organisms. In such an architecture, every artificial “cell” contains a complete copy of the descri...

متن کامل

A Constructive Proof of the Turing Completeness of Circal

This paper gives a proof of the Turing completeness of the Circal process algebra by exhibiting a universal program capable of mapping any Turing machine description into Circal specifications that effectively simulate the behaviour of the given machine.

متن کامل

Syntax Evolution: Problems and Recursion

We are Turing complete, and natural language parsing is decidable, so our syntactic abilities are in excess to those needed to speak a natural language. This is an anomaly, because evolution would not select and keep an overqualified feature. We solve this anomaly by using a coincidence, both syntax and problem solving are computing, and a difference, Turing completeness is not a requirement of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Found. Comput. Sci.

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1992